Agressive Transmissions over Redundant Paths for Time Critical Messages
نویسندگان
چکیده
Fault-tolerant computer systems have redundant paths connecting their components. Given these paths, it is possible to use aggressive techniques to reduce the average value and variability of the response time for critical messages. One technique is to send a copy of a packet over an alternate path before it is known if the first copy failed or was delayed. A second technique is to split a single stream of packets over multiple paths. We analyze both approaches and show that they can provide significant improvements over conventional, conservative mechanisms. This paper is a revised and extended version of [7]. The main differences from [7] are the inclusion of Section 4 and the Appendix (containing proofs).
منابع مشابه
Improved Dynamic Partial-Order Reduction for Asynchronous Message-Passing Programs
This paper presents two algorithmic refinements that improve systematic testing of asynchronous message-passing programs for a fixed input. Such programs can have a large number of possible execution paths due to the nondeterministic interleaving of messages. However, many paths are equivalent, and dynamic partial-order reduction (DPOR) techniques attempt to explore all distinct, feasible behav...
متن کاملAn Algorithm to Obtain Possibly Critical Paths in Imprecise Project Networks
We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all pos...
متن کاملER: Energy Efficient Routing for Multi-hop Green Wireless Networks
Wireless communication consumes a significant amount of energy in wireless networks. Most multi-hop wireless routing protocols are adopted from wired network routing protocols and use pre-selected single or multiple minimum cost paths to forward data packets. However unlike wired networks, a wireless network has unique characteristics such as unreliable wireless links and multiple receivers ass...
متن کاملNetlets for End-To-End Delay Minimization in Distributed Computing Over the Internet Using Two-Paths
In a number of distributed computing applications, messages must be transmitted on demand between processes running at different locations on the Internet. The end-to-end delays experienced by the messages have a significant “random” component due to the complicated nature of network traffic. We propose a method based on delay-regression estimation to achieve low end-to-end delays for message t...
متن کاملMultipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks
In this paper we discuss the mechanism of multipoint relays (MPRs) to efficiently do the flooding of broadcast messages in the mobile wireless networks. Multipoint relaying is a technique to reduce the number of redundant re-transmissions while diffusing a broadcast message in the network. We discuss the principle and the functioning of MPRs, and propose a heuristic to select these MPRs in a mo...
متن کامل